The Strength of Turing Determinacy within Second Order Arithmetic
نویسندگان
چکیده
We investigate the reverse mathematical strength of Turing determinacy up to Σ5 which is itself not provable in second order arithmetic.
منابع مشابه
The Limits of Determinacy in Second Order Arithmetic: Consistency and Complexity Strength
We prove that determinacy for all Boolean combinations of Fσδ (Π 0 3) sets implies the consistency of second-order arithmetic and more. Indeed, it is equivalent to the statement saying that for every set X and every number n, there exists a β-model of Πn-comprehension containing X. We prove this result by providing a careful level-by-level analysis of determinacy at the finite level of the diff...
متن کاملDeterminacy of Wadge classes and subsystems of second order arithmetic
In this paper we study the logical strength of the determinacy of infinite binary games in terms of second order arithmetic. We define new determinacy schemata inspired by the Wadge classes of Polish spaces and show the following equivalences over the system RCA0, which consists of the axioms of discrete ordered semi-ring with exponentiation, ∆1 comprehension and Π 0 0 induction, and which is k...
متن کاملThe Strength of Projective Martin Conjecture
We show that Martin’s conjecture on Π1-functions uniformly ≤T -order preserving on a cone implies Π1 Turing Determinacy over ZF+DC. In addition, it is also proved that for n ≥ 0, this conjecture for uniformly degree invariant Π2n+1functions is equivalent over ZFC to Σ2n+2-Axiom of Determinacy. As a corollary, the consistency of the conjecture for Π1-uniformly degree invariant functions implies ...
متن کاملDeterminacy and Π 11 transfinite recursion along ω
It is known that almost all important set existence axioms in second order arithmetic can be characterized by determinacy schemes of infinite games. In this article, we sketch the proof of the equivalence between Π1 transfinite recursion along ω and determinacy scheme.
متن کاملThe Limits of Determinacy in Second Order Arithmetic
We establish the precise bounds for the amount of determinacy provable in second order arithmetic. We show that for every natural number n, second order arithmetic can prove that determinacy holds for Boolean combinations of n many Π3 classes, but it cannot prove that all finite Boolean combinations of Π3 classes are determined. More specifically, we prove that Πn+2-CA0 ` n-Π3-DET, but that ∆n+...
متن کامل